Channel: PBS Infinite Series

Category: Education

Tags: infinite seriespbsrsaeducationmodmathematicsinfinitecryptographyquantumquantum computersshor's algorithmhackingcomputingencryptionseriesquantum computingrsa cryptographymathcomputersstemalgorithm

Description: Viewers like you help make PBS (Thank you 😃) . Support your local PBS Member Station here: to.pbs.org/donateinfi Classical computers struggle to crack modern encryption. But quantum computers using Shor’s Algorithm make short work of RSA cryptography. Find out how. Tweet at us! @pbsinfinite Facebook: facebook.com/pbsinfinite series Email us! pbsinfiniteseries [at] gmail [dot] com Previous Episode How to Break Cryptography youtube.com/watch?v=12Q3Mrh03Gk The Mathematics Behind Quantum Computers youtube.com/watch?v=IrbJYsep45E Additional Resources: Scott Aaronson's Blog (Great Intro to Shor's Alg.):: scottaaronson.com/blog/?p=208 Shor's Original Paper:: arxiv.org/abs/quant-ph/9508027v2 Lectures on Shor's Algorithm:: arxiv.org/pdf/quant-ph/0010034.pdf Decrypting secure messages often involves attempting to find the factors that make up extremely large numbers. This process is too time consuming for classical computers but Shor’s Algorithm shows us how Quantum Computers can greatly expedite the process. Written and Hosted by Kelsey Houston-Edwards Produced by Rusty Ward Graphics by Ray Lux Made by Kornhaber Brown (kornhaberbrown.com) Thanks to Spiros Michalakis for helpful discussions and feedback. Comments answered by Kelsey: Neon Bull youtube.com/watch?v=12Q3Mrh03Gk&lc=z135uxf5cxenutmxj04cc3swkvm4tpcrxik Bhargav R youtube.com/watch?v=12Q3Mrh03Gk&lc=z13qjjioozbjdrqyz04cevdrtu3ti3y5sq40k BobC youtube.com/watch?v=12Q3Mrh03Gk&lc=z12pjpzastylzz2qx04cjtc5jrq2y3yhmlk0k